@book{applegate2011traveling,
  title={The traveling salesman problem: a computational study},
  author={Applegate, David L and Bixby, Robert E and Chvatal, Vasek and Cook, William J},
  year={2011},
  publisher={Princeton University Press}
}

@article{fischetti2003local,
  title={Local branching},
  author={Fischetti, Matteo and Lodi, Andrea},
  journal={Mathematical Programming},
  volume={98},
  number={1-3},
  pages={23--47},
  year={2003},
  publisher={Springer}
}

@techreport{fischetti2012proximity,
  title={Proximity search for 0-1 mixed-integer convex programming},
  author={Fischetti, Matteo and Monaci, Michele},
  year={2012},
  institution={Technical Report, DEI, University of Padova (in preparation)}
}


@article{danna2005exploring,
  title={Exploring relaxation induced neighborhoods to improve MIP solutions},
  author={Danna, Emilie and Rothberg, Edward and Le Pape, Claude},
  journal={Mathematical Programming},
  volume={102},
  number={1},
  pages={71--90},
  year={2005},
  publisher={Springer}
}

@article{rothberg2007evolutionary,
  title={An evolutionary algorithm for polishing mixed integer programming solutions},
  author={Rothberg, Edward},
  journal={INFORMS Journal on Computing},
  volume={19},
  number={4},
  pages={534--541},
  year={2007},
  publisher={INFORMS}
}

@article{padberg1991branch,
  title={A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems},
  author={Padberg, Manfred and Rinaldi, Giovanni},
  journal={SIAM review},
  volume={33},
  number={1},
  pages={60--100},
  year={1991},
  publisher={SIAM}
}

@article{miliotis1978using,
  title={Using cutting planes to solve the symmetric travelling salesman problem},
  author={Miliotis, P},
  journal={Mathematical programming},
  volume={15},
  number={1},
  pages={177--188},
  year={1978},
  publisher={Springer}
}

@article{helsgaun2000effective,
  title={An effective implementation of the Lin--Kernighan traveling salesman heuristic},
  author={Helsgaun, Keld},
  journal={European Journal of Operational Research},
  volume={126},
  number={1},
  pages={106--130},
  year={2000},
  publisher={Elsevier}
}

@article{lin1973effective,
  title={An effective heuristic algorithm for the traveling-salesman problem},
  author={Lin, Shen and Kernighan, Brian W},
  journal={Operations research},
  volume={21},
  number={2},
  pages={498--516},
  year={1973},
  publisher={INFORMS}
}

@article{reinelt1991tsplib,
  title={TSPLIB—A traveling salesman problem library},
  author={Reinelt, Gerhard},
  journal={ORSA journal on computing},
  volume={3},
  number={4},
  pages={376--384},
  year={1991},
  publisher={INFORMS}
}

@article{croes1958method,
  title={A method for solving traveling-salesman problems},
  author={Croes, GA},
  journal={Operations Research},
  volume={6},
  number={6},
  pages={791--812},
  year={1958},
  publisher={INFORMS}
}

@misc{applegate2006concorde,
  title={Concorde TSP solver},
  author={Applegate, David and Bixby, Robert and Chvatal, Vasek and Cook, William},
  year={2006}
}

@article{held1970traveling,
  title={The traveling-salesman problem and minimum spanning trees},
  author={Held, Michael and Karp, Richard M},
  journal={Operations Research},
  volume={18},
  number={6},
  pages={1138--1162},
  year={1970},
  publisher={INFORMS}
}

@article{held1971traveling,
  title={The traveling-salesman problem and minimum spanning trees: Part II},
  author={Held, Michael and Karp, Richard M},
  journal={Mathematical programming},
  volume={1},
  number={1},
  pages={6--25},
  year={1971},
  publisher={Springer}
}

@article{volgenant1982branch,
  title={A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation},
  author={Volgenant, Ton and Jonker, Roy},
  journal={European Journal of Operational Research},
  volume={9},
  number={1},
  pages={83--89},
  year={1982},
  publisher={Elsevier}
}

@article{benchimol2012improved,
  title={Improved filtering for weighted circuit constraints},
  author={Benchimol, Pascal and Van Hoeve, Willem-Jan and R{\'e}gin, Jean-Charles and Rousseau, Louis-Martin and Rueher, Michel},
  journal={Constraints},
  volume={17},
  number={3},
  pages={205--233},
  year={2012},
  publisher={Springer}
}

@incollection{benchimol2010improving,
  title={Improving the held and karp approach with constraint programming},
  author={Benchimol, Pascal and R{\'e}gin, Jean-Charles and Rousseau, Louis-Martin and Rueher, Michel and van Hoeve, Willem-Jan},
  booktitle={Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems},
  pages={40--44},
  year={2010},
  publisher={Springer}
}

@article{agnetis2012rilassamento,
  title={Il rilassamento Lagrangiano nella soluzione di problemi di programmazione lineare intera},
  author={Agnetis, Alessandro and Detti, Paolo},
  year={2012}
}

@article{land1960automatic,
  title={An automatic method of solving discrete programming problems},
  author={Land, Ailsa H and Doig, Alison G},
  journal={Econometrica},
  volume={28},
  number={3},
  pages={497--520},
  year={1960},
  publisher={Citeseer}
}
